-
1 relative algorithm
Большой англо-русский и русско-английский словарь > relative algorithm
-
2 relative algorithm
Математика: относительный алгоритм -
3 relative algorithm
-
4 algorithm
-
5 относительный алгоритм
Большой англо-русский и русско-английский словарь > относительный алгоритм
-
6 RBA
1) Общая лексика: hum. сокр. Receptor Binding Assay, hum. сокр. Reproduction Biology Associates, Atlanta, Georgia, Registration Board of Assessors2) Американизм: Revolution By Assassination3) Военный термин: Ranger Battalions Association, radio beacon array, reentry body assembly, rescue breathing apparatus, rotary beam antenna, rotor blade antenna4) Техника: radial blanket assembly5) Музыка: Redwood Bluegrass Associates6) Сокращение: Royal Bhutan Army, Royal Society of British Artists, Reliability Branching Algorithm, Radio Binding Assay, Radiobinding Assay, Radioligand Binding Assay, Rat Brain Astrocytes, Receptor Binding Affinity, Relative Binding Affinity, Renaturation Blotting Assay, Respiratory Burst Activity, Retrobulbar Anaesthesia, Rhythmical Bursting Activity, Right Basilar Artery, Risk Based Approach8) Банковское дело: резервный банк Австралии (Reserve Bank of Australia), ЦБ Австралии9) Фирменный знак: Reproduction Biology Associates, Atlanta, Georgia10) Программирование: Relative Byte Address11) Макаров: relative binding affinities12) NYSE. Ritchie Brothers Auctioneers, Inc. -
7 O notation
"An indication of the relative performance of an algorithm. An algorithm or the method that implements it is said to be O(1) if its execution is a constant, O(log n) if its execution is proportional to the natural log of n, or O(n) if its execution is proportional to n. O notation is frequently used as a way to compare the relative performance of operations on collections, in which case n is usually the number of elements in the collection." -
8 RAPD
1) Общая лексика: relative afferent pupillary defect, относительный афферентный дефект зрачка2) Военный термин: recognized air picture display4) Сетевые технологии: Rapid Application Protocol Driver5) Генная инженерия: Randomly Amplified Polymormphic DNA (случайным образом (случайно) амплифицированная полиморфная ДНК (способ изучения изменчивости))6) Базы данных: Resource For Algorithm For Preprocessing The Database -
9 convergence
1) конвергенция; сближение2) совпадение3) стремление4) сходимость5) горн. схождение пластов6) горн. оседание•Abel test for convergence — матем. признак сходимости Абеля
convergence in measure —сходимость по мере
convergence with probability one — сходимость с вероятностью единица, достоверная сходимость
-
10 stability
1) устойчивость2) стабильность3) стойкость4) равновесное состояние ( системы)•stability in large — мат. устойчивость в большом
stability in small — мат. устойчивость в малом
-
11 LRU
алгоритм сбрасывания сегментов памяти
Алгоритм сбрасывания сегментов памяти, в соответствии с которым удаляются области памяти, к которым наиболее долго не было обращения.
[Е.С.Алексеев, А.А.Мячев. Англо-русский толковый словарь по системотехнике ЭВМ. Москва 1993]Тематики
EN
линейный сменный блок
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
относительный уровень напряжения
Отношение, выраженное в децибелах, значения напряжения сигнала в какой-либо точке линии передачи относительно значения напряжения этого же сигнала, в точке линии, выбранной для сравнения (ОСТ 45.159-2000.1 Термины и определения (Минсвязи России)).
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > LRU
См. также в других словарях:
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Kahan summation algorithm — In numerical analysis, the Kahan summation algorithm (also known as compensated summation) significantly reduces the numerical error in the total obtained by adding a sequence of finite precision floating point numbers, compared to the obvious… … Wikipedia
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Deutsch–Jozsa algorithm — The Deutsch–Jozsa algorithm is a quantum algorithm, proposed by David Deutsch and Richard Jozsa in 1992[1] with improvements by Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca in 1998.[2] Although it is of little practical use … Wikipedia
Eight-point algorithm — The eight point algorithm is an algorithm used in computer vision to estimate the essential matrix or the fundamental matrix related to a stereo camera pair from a set of corresponding image points. It was introduced by Christopher Longuet… … Wikipedia
Hopcroft–Karp algorithm — The Hopcroft–Karp algorithm finds maximum cardinality matchings in bipartite graphs in O(sqrt{V} E) time, where V is the number of vertices and E is the number of edges of the graph. [John E. Hopcroft, Richard M. Karp: An n^{5/2} Algorithm for… … Wikipedia
Buchberger's algorithm — In computational algebraic geometry and computational commutative algebra, Buchberger s algorithm is a method of transforming a given set of generators for a polynomial ideal into a Gröbner basis with respect to some monomial order. It was… … Wikipedia
Selection algorithm — In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic). This includes the cases of finding the minimum, maximum, and median elements. There are… … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Maze generation algorithm — Maze generation algorithms are automated methods for the creation of mazes. This maze generated by modified version of Prim s algorithm, below. Contents 1 Graph theory based methods … Wikipedia
